A note on gray code and odd-even merge

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Average Running Time of Odd-Even Merge Sort

Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...

متن کامل

ASCII based Even-Odd Cryptography with Gray code and Image Steganography: A dimension in Data Security

The message is the composition of some character. Every character of the message can be represented as an ASCII value, which is either even or odd. Depending on this evenness or oddness, the character is encrypted differently. This paper describes how such an even-odd encryption based on ASCII value is applied and how encrypted message converting by using Gray code and embedding with picture ca...

متن کامل

Synchrotron Radiation Studies on Even-Odd and Odd-Even Nylons

Aliphatic polyamides derived from odd diamine or odd dicarboxylic acid units cannot adopt a conventional sheet structure when molecular chains have an all trans conformation. However, typical fiber diffraction patterns of this sheet structure were observed in several polyamides derived from odd units such as nylons 65 and 56. Consequently, a new structure based on the establishment of intermole...

متن کامل

A note on the total number of cycles of even and odd permutations

We prove bijectively that the total number of cycles of all even permutations of [n] = {1, 2, . . . , n} and the total number of cycles of all odd permutations of [n] differ by (−1)(n − 2)!, which was proposed by Miklós Bóna. We also prove bijectively the following more general identity: n

متن کامل

Performance Analysis of Odd-even Merge Sort by Using Openmp, Mpi and Concurrent Java

Sorting is a method which arranges the list of elements into a particular order. sorting has two different meanings ordering and categorizing, ordering means to order the list of same items and categorizing means grouping and labeling the same type of items[2]. sorting is used in other algorithms that require sorted list to work efficiently. The odd-even merge sort algorithm was developed by K....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1987

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(87)80006-9